A wireless sensor
network consists of spatially
distributed autonomous sensors to physical or environmental
conditions, such as temperature, sound, pressure, etc. and
cooperatively pass their data through the network to main
location. When the data transmission between one node to
another, there is some of the nodes in the network are
because of above mentioned issues. So, the data will not be
transferred to the destination. Because of these failures of
the network is divided into multiple parts. The ability to
the cuts by using the source node and disconnected node of a
wireless sensor network will lead to the increase in the
network. The Distributed Cut Detection (DCD) algorithm
proposed here enables every node of wireless sensor network
detect Disconnected from Source events if they occur.
enables a subset of nodes that experience CCOS events to
them and find the approximate location of the cut in the
a list of active nodes that lie at the boundary of the cut.
advantage of DCD algorithm is that convergence rate of the
iterative scheme is quite fast and independent of the size
structure of network.
Uploaded by IJTEL Archive on